Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
نویسندگان
چکیده
A total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. We show that given a graph of order n with minimum degree at least 2, one can add at most (n−2√n )/4+O(log n) edges such that the resulting graph has two disjoint total dominating sets, and this bound is best possible.
منابع مشابه
TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملOn graphs with disjoint dominating and 2-dominating sets
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only con...
متن کاملThe Disjoint Total Domination Number of a Graph
The disjoint total domination number of a graph G is the minimum cardinality of the union of two disjoint total dominating sets in G. We also consider an invariant the minimum cardinality of the disjoint union of a dominating set and a total dominating set. In this paper, we initiate a study of these parameters.
متن کاملPairs of Disjoint Dominating Sets and the Minimum Degree of Graphs
For a connected graph G of order n and minimum degree δ we prove the existence of two disjoint dominating sets D1 and D2 such that, if δ ≥ 2, then |D1∪D2| ≤ 67n unless G = C4, and, if δ ≥ 5, then |D1 ∪ D2| ≤ 2 δ+1 n. While for the first estimate there are exactly six extremal graphs which are all of order 7, the second estimate is asymptotically best-possible.
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 300 شماره
صفحات -
تاریخ انتشار 2005